Packing Non-Returning A-Paths

Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity

Mader’s disjoint S-paths problem is a common generalization of matching and Menger’s disjoint paths problems. Lovász (1980) suggested a polynomial-time algorithm for this problem through a reduction to matroid matching. A more direct reduction to the linear matroid parity problem was given later by Schrijver (2003), which leads to faster algorithms. As a generalization of Mader’s problem, Chudn...

Packing non-returning A-paths algorithmically

In this paper we present an algorithmic approach to packing A-paths. It is regarded as a generalization of Edmonds’ matching algorithm, however there is the significant difference that here we do not build up any kind of alternating tree. Instead we use the so-called 3-way lemma, which either provides augmentation, or a dual, or a subgraph which can be used for contraction. The method works in ...

Goal Programming and Heuristic Search

The A* algorithm belongs to the class of best first graph-search algorithms and is frequently used to find minimum-cost paths. Recently, A* has been generalised to solve multiple-objective search problems, returning the set of non-dominated solution paths. This paper presents METAL-A*, an admissible heuristic search algorithm for search problems with lexicographic goals that returns the set of ...

An Algorithm for Packing Non-zero A-paths in Group-labeled Graphs

Complexity and approximation results for bounded-size paths packing problems

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...